Getting around the Halting Problem
نویسنده
چکیده
The Halting Theorem establishes that there is no machine H that can decide in all cases if a machine n halts on input m. The conjecture of this paper is that nevertheless there exist a machine H such that it can identify all the cases it is unable to decide. This become possible if the Recursion Theorem is reinterpreted as mutual necessitation rather than equivalence.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملPsychological Coping Strategies and Techniques to deal with Stress & Anxiety around Coronavirus (COVID-19)
In early 2020, people around the world, beyond color, race, social class, nationality, or geography, have been plagued by a common problem called coronavirus and COVID-19. There is an increasing amount of anxiety, worry and stress around the world, and we are witnessing the death of dozens of people every hour. In the days when society is facing more than ever an unbalanced amount of misinforma...
متن کاملFormalizing the Halting Problem in a Constructive Type Theory
We present a formalization of the halting problem in Agda, a language based on Martin-Löf’s intuitionistic type theory. The key features are: – We give a constructive proof of the halting problem. The “constructive halting problem” is a natural reformulation of the classic variant. – A new abstract model of computation is introduced, in type theory. – The undecidability of the halting problem i...
متن کاملEquivalence Relations and the Halting Problem
We investigate which computable equivalence structures are isomorphic relative to the Halting problem.
متن کاملOn the Halting Problem of Finite-State Programs
The undecidability of the halting problem is a well-known research result of theoretical computer science, dating back to Turing’s work in 1936. Nevertheless, it is commonly known that the halting problem on finite-state computer systems is decidable. Thus, any undecidability proof given for the halting problem must imply that it does not apply to finite-state computer systems. The aim of this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.03392 شماره
صفحات -
تاریخ انتشار 2017